Here and There with Arithmetic

In the theory of answer set programming, two groups rules are called strongly equivalent if, informally speaking, they have same meaning in any context. The relationship between strong equivalence and propositional logic here-and-there allows us to establish by deriving each group from other. process, rewritten as formulas. We extend this method proving an programming language that includes operations on integers. formula representing a rule is first-order may contain comparison symbols among its predicate constants, for arithmetic function constants. paper under consideration acceptance TPLP.